An algorithm for semi-infinite transportation problems
نویسندگان
چکیده
منابع مشابه
An algorithm for semi-infinite polynomial optimization
We consider the semi-infinite optimization problem: f := min x∈X {f(x) : g(x,y) ≤ 0, ∀y ∈ Yx }, where f, g are polynomials and X ⊂ R as well as Yx ⊂ R , x ∈ X, are compact basic semi-algebraic sets. To approximate f we proceed in two steps. First, we use the “joint+marginal” approach of the author [9] to approximate from above the function x 7→ Φ(x) = sup{g(x,y) : y ∈ Yx} by a polynomial Φd ≥ Φ...
متن کاملSubsmooth semi-infinite and infinite optimization problems
We first consider subsmoothness for a function family and provide formulas of the subdifferential of the pointwsie supremum of a family of subsmooth functions. Next, we consider subsmooth infinite and semi-infinite optimization problems. In particular, we provide several dual and primal characterizations for a point to be a sharp minimum or a weak sharp minimum for such optimization problems.
متن کاملAn Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
In this paper, we propose an explicit exchange algorithm for solving semiinfinite programming problem (SIP) with second-order cone (SOC) constraints. We prove, by using the slackness complementarity conditions, that the algorithm terminates in a finite number of iterations and the obtained solution sufficiently approximates the original SIP solution. In existing studies on SIPs, only the nonneg...
متن کاملAn algorithm for solving variable coefficient hyperbolic problems in a semi-infinite mediu
This paper provides an algorithm for constructing numerical solutions of variable coefficient problems in a semi-infinite medium. Using sine Fourier transform an integral expression of the solution is found. Then numerical integration and the numerical solution of certain underlying differential equations are used to establish the algorithm.
متن کاملNon-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2007.02.013